logical formalization

См. также в других словарях:

• Closed world assumption — The closed world assumption (CWA) is the presumption that what is not currently known to be true, is false. The same name also refers to a logical formalization of this assumption by Raymond Reiter. The opposite of the closed world assumption is… …   Wikipedia

• Marek Jerzy Minakowski — (born 13 June 1972 in Olsztyn) is a Polish philosopher[1], historian and genealogist[2], author of the Wielką genealogię .[3] Graduated from the Jagiellonian University with the dissertation Formal Logic before Aristotle which was the result of… …   Wikipedia

• Descartes: methodology — Stephen Gaukroger INTRODUCTION The seventeenth century is often referred to as the century of the Scientific Revolution, a time of fundamental scientific change in which traditional theories were either replaced by new ones or radically… …   History of philosophy

• Belief revision — is the process of changing beliefs to take into account a new piece of information. The logical formalization of belief revision is researched in philosophy, in databases, and in artificial intelligence for the design of rational agents.What… …   Wikipedia

• Antimatroid — In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included. Antimatroids …   Wikipedia

• Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… …   Wikipedia

• Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

• Alfred Tarski — Infobox scientist name = Alfred Tarski caption = birth date = birth date|1901|01|14 birth place = Warsaw, Poland (under Russian rule at the time) death date = death date|1983|10|26 death place = Berkeley, California fields = Mathematics, logic,… …   Wikipedia

• КАРНАП — (Саrnар) Рудольф (1891 1970) аналитический философ и логик, один из лидеров Венского кружка, ведущий представитель логического позитивизма. Приват доцент Венского (1926 1931), проф. Германского (Прага, 1931 1935) ун тов; после эмиграции в США… …   Философская энциклопедия

• Axiom — This article is about logical propositions. For other uses, see Axiom (disambiguation). In traditional logic, an axiom or postulate is a proposition that is not proven or demonstrated but considered either to be self evident or to define and… …   Wikipedia

• Primitive recursive arithmetic — Primitive recursive arithmetic, or PRA, is a quantifier free formalization of the natural numbers. It was first proposed by Skolem [Thoralf Skolem (1923) The foundations of elementary arithmetic in Jean van Heijenoort, translator and ed. (1967)… …   Wikipedia